Dilation properties of coherent Nearly-Linear models
نویسندگان
چکیده
Dilation is a puzzling phenomenon within Imprecise Probability theory: when it obtains, our uncertainty evaluation on event $A$ vaguer after conditioning $B$, whatever $B$ in given partition $\mathcal{B}$. In this paper we investigate dilation with coherent Nearly-Linear (NL) models. These are family of neighbourhood models, obtaining lower/upper probabilities by linear affine transformations (with barriers) probability, and encompass several well-known such as the Pari-Mutuel Model, $\varepsilon$-contamination model, Total Variation others. We first recall results recently obtained for NL model standard procedure natural extension separately discuss role alternative regular extension. Then, characterise For their most relevant subfamily, Vertical Barrier Models (VBM), study coarsening property dilation, extent constriction. The generalise existing ones established special VBMs. As an interesting aside, general framework how logical (in)dependence from $\mathcal{B}$ or extreme evaluations influence dilation.
منابع مشابه
Equivalence of Models of Computation for Nearly Linear Time
Theorem 1 (Main Theorem). Every non-deterministic RAM computation in time t can be simulated by a non-deterministic oblivious two-tape TM in time t polylog(t). We prove this theorem in two steps. First, we show how to simulate non-deterministic RAM machines using non-deterministic multi-tape TMs with polylogarithmic overhead. Then, we show how to simulate multi-tape TMs using oblivious two-tape...
متن کاملModels of Horn Formulas are Enumerable at Nearly Linear Delay
The Unique satisfiability problem of Horn formulas was proved to be quadratic by Minoux (1992) [3]. Using ideas based on those of [3], Berman, Franco, and Schilpf (1995) [1] proved it to be nearly linear. We simplify the presentation of their algorithm and adapt it slightly in order to perform enumeration of the solutions at a delay that is their unique solution decision time, i.e. O(α(|F |)|F ...
متن کاملLinear Scheduling is Nearly
This paper deals with the problem of nding optimal schedulings for uniform dependence algorithms. Given a convex domain, let T f be the total time needed to execute all computations using the free (greedy) schedule and let T l be the total time needed to execute all computations using the optimal linear schedule. Our main result is to bound T l =T f and T l ?T f for suuciently \fat" domains.
متن کاملNearly Sparse Linear Algebra
In this article, we propose a method to perform linear algebra on a matrix with nearly sparse properties. More precisely, although we require the main part of the matrix to be sparse, we allow some dense columns with possibly large coefficients. We modify Block Wiedemann algorithm and show that the contribution of these heavy columns can be made negligible compared to the one of the sparse part...
متن کاملNearly Linear Time
The notion of linear-time computability is very sensitive to machine model. In this connection, we introduce a class NLT of functions computable in nearly linear time n(log n)O(1) on random access computers. NLT is very robust and does not depend on the particular choice of random access computers. Kolmogorov machines, Schonhage machines, random access Turing machines, etc. also compute exactl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2022
ISSN: ['1873-4731', '0888-613X']
DOI: https://doi.org/10.1016/j.ijar.2021.10.009